The Escaping Set of the Exponential

نویسنده

  • LASSE REMPE
چکیده

We show that the set I(f) of points that converge to infinity under iteration of the exponential map f(z) = exp(z) is a connected subset of the complex plane.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Dynamics of Exponential Maps on Their Escaping Sets

For the family of exponential maps Eκ(z) = exp(z)+κ, we prove an analog of Böttcher’s theorem by showing that any two exponential maps Eκ1 and Eκ2 are conjugate on suitable subsets of their escaping sets, and this conjugacy is quasiconformal. Furthermore, we prove that any two attracting and parabolic exponential maps are conjugate on their sets of escaping points; in fact, we construct an anal...

متن کامل

On Nonlanding Dynamic Rays of Exponential Maps

We consider the case of an exponential map Eκ : z 7→ exp(z) + κ for which the singular value κ is accessible from the set of escaping points of Eκ. We show that there are dynamic rays of Eκ which do not land. In particular, there is no analog of Douady’s “pinched disk model” for exponential maps whose singular value belongs to the Julia set. We also prove that the boundary of a Siegel disk U fo...

متن کامل

Dimensions of slowly escaping sets and annular itineraries for exponential functions

We study the iteration of functions in the exponential family. We construct a number of sets, consisting of points which escape to infinity ‘slowly’, and which have Hausdorff dimension equal to 1. We prove these results by using the idea of an annular itinerary. In the case of a general transcendental entire function we show that one of these sets, the uniformly slowly escaping set, has strong ...

متن کامل

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

متن کامل

Exponential membership function and duality gaps for I-fuzzy linear programming problems

Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008